Finding Matchings in the Streaming Model
نویسنده
چکیده
This report presents algorithms for finding large matchings in the streaming model. In this model, applicable when dealing with massive graphs, edges are streamed-in in some arbitrary order rather than residing in randomly accessible memory. For ε > 0, we achieve a 1/(1+ε) approximation for maximum cardinality matching and a 1/(2+ε) approximation to maximum weighted matching. Both algorithms use a constant number of passes. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-04-19. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/21 Finding Matchings in the Streaming Model
منابع مشابه
Finding Graph Matchings in Data Streams
We present algorithms for finding large graph matchings in the streaming model. In this model, applicable when dealing with massive graphs, edges are streamed-in in some arbitrary order rather than residing in randomly accessible memory. For ǫ > 0, we achieve a 1 1+ǫ approximation for maximum cardinality matching and a 1 2+ǫ approximation to maximum weighted matching. Both algorithms use a cons...
متن کاملStreaming Verification of Graph Properties
Streaming interactive proofs (SIPs) are a framework for outsourced computation, so that a computationally limited streaming client (the verifier) hands over a large data set to an untrusted server (the prover) in the cloud and the two parties run a protocol to confirm the correctness of result with high probability. SIPs are particularly interesting for problems that are hard to solve (or even ...
متن کاملMaximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model
We study the problem of finding an approximate maximum matching in two closely related computational models, namely, the dynamic graph streaming model and the simultaneous multi-party communication model. In the dynamic graph streaming model, the input graph is revealed as a stream of edge insertions and deletions, and the goal is to design a small space algorithm to approximate the maximum mat...
متن کاملBipartite Graph Matchings in the Semi-streaming Model
We present an algorithm for finding a large matching in a bipartite graph in the semi-streaming model. In this model, the input graph G = (V,E) is represented as a stream of its edges in some arbitrary order, and storage of the algorithm is bounded by O(n polylogn) bits, where n = |V |. For > 0, our algorithm finds a 1 1+ -approximation of a maximum-cardinality matching and uses O “ ( 1 ) ” pas...
متن کاملModelling and Scheduling Lot Streaming Flexible Flow Lines
Although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. This paper deals with scheduling jobs in lot streaming flexible flow line problems. The paper mathematically formulates the problem by a mixed integer linear programming model. This model solves small instances to optimality. Moreo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014